Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems

In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing (BPP) Travelling Salesman (TSP). For each case, algorithm is introduced, together with design of numerical experiments, in order to empirically establish its performance from both points view: computational time accuracy.